Negation in the Head of CP-logic Rules

نویسنده

  • Joost Vennekens
چکیده

CP-logic is a probabilistic extension of the logic FO(ID). Unlike ASP, both of these logics adhere to a Tarskian informal semantics, in which interpretations represent objective states-of-affairs. In other words, these logics lack the epistemic component of ASP, in which interpretations represent the beliefs or knowledge of a rational agent. Consequently, neither CP-logic nor FO(ID) have the need for two kinds of negations: there is only one negation, and its meaning is that of objective falsehood. Nevertheless, the formal semantics of this objective negation is mathematically more similar to ASP’s negation-as-failure than to its classical negation. The reason is that both CP-logic and FO(ID) have a constructive semantics in which all atoms start out as false, and may only become true as the result of a rule application. This paper investigates the possibility of adding the well-known ASP feature of allowing negation in the head of rules to CP-logic. Because CP-logic only has one kind of negation, it is of necessity this “negation-as-failure like” negation that will be allowed in the head. We investigate the intuitive meaning of such a construct and the benefits that arise from it.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Answer Set Programming and Other Computing Paradigms

Modular Systems and Solvers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 143 Y. Lierler (University of Nebraska at Omaha) and M. Truszczynski (University of Kentucky) Negation in the Head of CP-logic Rules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 159 J. Vennekens (University of Leuven) Author Index . . . . . . . . . . . . . . . . . . . . . . . . . ....

متن کامل

Partial Stable Generated Models of Generalized Logic Programs with Constraints

Logic programs are an important knowledge representation tool. In many cases, definite logic programs are too restricted to formalize problems intuitively. Therefore definite logic programs have been extended in several ways by additional syntactic constructs such as negation and disjunction. A very expressive program class are generalized logic programs. Their rules may contain any quantifier ...

متن کامل

A primer on Answer Set Programming

where A0, . . . An are atoms and not is a logical connective called negation as failure. Also, for every rule let us define head(ρ) = A0, pos(ρ) = A1, . . . , Am, neg(ρ) = Am+1, . . . , An and body(ρ) = pos(ρ)∪ neg(ρ). The head of rules is never empty, while if body(ρ) = ∅ we refer to ρ as a fact. A logic program is defined as a collection of rules. Rules with variables are taken as shorthand f...

متن کامل

On Strong and Default Negation in Logic Program Updates

Existing semantics for answer-set program updates fall into two categories: either they consider only strong negation in heads of rules, or they primarily rely on default negation in heads of rules and optionally provide support for strong negation by means of a syntactic transformation. In this paper we pinpoint the limitations of both these approaches and argue that both types of negation sho...

متن کامل

Discovering Classes of Strongly Equivalent Logic Programs with Negation as Failure in the Head

In this paper, we apply Fangzhen Lin’s methodology of computer aided theorem discovery to discover classes of strongly equivalent logic programs with negation as failure in the head. Specifically, with the help of computers, we discover exact conditions that capture the strong equivalence between small sets of rules, which have potential applications in the theory and practice of logic programm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1312.6156  شماره 

صفحات  -

تاریخ انتشار 2013